Generalized r-cohesiveness and the arithmetical hierarchy: a correction to “Generalized cohesiveness”

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized R-Cohesiveness and The Arithmetical Hierarchy: A Correction to "Generalized Cohesiveness"

ForX ⊆ ω, let [X] denote the class of all n-element subsets of X. An infinite set A ⊆ ω is called n-r-cohesive if for each computable function f : [ω] → {0, 1} there is a finite set F such that f is constant on [A−F ]. We show that for each n ≥ 2 there is no Πn set A ⊆ ω which is n-r-cohesive. For n = 2 this refutes a result previously claimed by the authors, and for n ≥ 3 it answers a question...

متن کامل

Se p 19 97 GENERALIZED COHESIVENESS

We study some generalized notions of cohesiveness which arise naturally in connection with effective versions of Ram-sey's Theorem. An infinite set A of natural numbers is n–cohesive (respectively, n–r–cohesive) if A is almost homogeneous for every computably enumerable (respectively, computable) 2–coloring of the n–element sets of natural numbers. (Thus the 1–cohesive and 1–r–cohesive sets coi...

متن کامل

Cohesiveness

It is characteristic of a continuum that it be “all of one piece”, in the sense of being inseparable into two (or more) disjoint nonempty parts. By taking “part” to mean open (or closed) subset of the space, one obtains the usual topological concept of connectedness. Thus a space S is defined to be connected if it cannot be partitioned into two disjoint nonempty open (or closed) subsets – or eq...

متن کامل

Cohesiveness in promise problems

Promise problems have been introduced in 1985 by S.Even e.a. as a generalization of decision problems. Using a very general approach we study solvability and unsolvability conditions for promise problems of set families and languages. We show, that cores of unsolvability are completely determined by partitions of cohesive sets. We prove the existence of cores in unsolvable promise problems assu...

متن کامل

Leveraging Group Cohesiveness to Form Workflow Teams

Past literature shows that workflows will be performed with greater efficiency and/or effectiveness if workflow teams have higher group cohesiveness. The major contribution of this work in progress is the creation and implementation of a formal generalized methodology that incorporates ideas from two diverse fields: social network theory and workflow modeling, and allows optimization of work gr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Logic

سال: 2002

ISSN: 0022-4812,1943-5886

DOI: 10.2178/jsl/1190150150